State Spaces — The Locale Way Norbert
نویسندگان
چکیده
Verification of imperative programs means reasoning about modifications of a program state. So proper representation of state spaces is crucial for the usability of a corresponding verification environment. In this paper we discuss various existing state space models under different aspects like strong typing, modularity and scalability. We also propose a variant based on the locale infrastructure of Isabelle. Thus we manage to combine the advantages of previous formulations (without suffering from their disadvantages), and gain extra flexibility in composing state space components (inherited from the modularity of locales).
منابع مشابه
State Spaces - The Locale Way
These theories introduce a new command called statespace. It’s usage is similar to records. However, the command does not introduce a new type but an abstract specification based on the locale infrastructure. This leads to extra flexibility in composing state space components, in particular multiple inheritance and renaming of components. The state space infrastructure basically manages the fol...
متن کاملA note on semi-regular locales
Semi-regular locales are extensions of the classical semiregular spaces. We investigate the conditions such that semi-regularization is a functor. We also investigate the conditions such that semi-regularization is a reflection or coreflection.
متن کاملThe Double Powerlocale and Exponentiation: a Case Study in Geometric Logic
If X is a locale, then its double powerlocale PX is defined to be PU(PL(X)) where PU and PL are the upper and lower powerlocale constructions. We prove various results relating it to exponentiation of locales, including the following. First, if X is a locale for which the exponential S exists (where S is the Sierpinski locale), then PX is an exponential S X . Second, if in addition W is a local...
متن کاملQuotient Spaces and Coequalisers in Formal Topology
We give a construction of coequalisers in formal topology, a predicative version of locale theory. This allows for construction of quotient spaces and identification spaces in constructive topology.
متن کاملComputable Sets: Located and Overt Locales
What is a computable set? One may call a bounded subset of the plane computable if it can be drawn at any resolution on a computer screen. Using the constructive approach to computability one naturally considers totally bounded subsets of the plane. We connect this notion with notions introduced in other frameworks. A subset of a totally bounded set is again totally bounded iff it is located. L...
متن کامل